392. Is Subsequence - LeetCode Solution

class Solution:
    def isSubsequence(self, s: str, t: str) -> bool:
        stack = list(s)
        stack.reverse()
        
        
        if len(s) == 0:
            return True
        
        
        
        for i in range(len(t)):
            if stack[-1] == t[i]:
                stack.pop()
                
            if len(stack) == 0:
                return True
                
                
        if len(stack) == 0:
            return True
        else:
            return False